Completing Partial Proper Colorings using Hall's Condition
نویسندگان
چکیده
منابع مشابه
Completing Partial Proper Colorings using Hall's Condition
In the context of list-coloring the vertices of a graph, Hall’s condition is a generalization of Hall’s Marriage Theorem and is necessary (but not sufficient) for a graph to admit a proper list-coloring. The graph G with list assignment L satisfies Hall’s condition if for each subgraph H of G, the inequality |V (H)| 6∑σ∈C α(H(σ, L)) is satisfied, where C is the set of colors and α(H(σ, L)) is t...
متن کاملProper Bounded Edge-Colorings
For xed integers k 2, and for n-element sets X and colorings : X] k ?! f0; 1; : : :g where every color class is a matching and has cardinality at most u, we show that there exists a totally multicolored subset Y X with jY j max (c 1 n k u 1 2k?1 ; c 2 n k u 1 2k?1 ln u p n 1 2k?1) where c 1 ; c 2 > 0 are constants. This lower bound is tight up to constant factors for u = (n 1=2+) for every > 0....
متن کاملMaximizing proper colorings on graphs
Article history: Received 17 November 2014 Available online xxxx
متن کاملProper Bounded Edge - Colorings ( Extended Abstract )
For an n-element set X and a proper coloring ∆: [X] −→ {0, 1, . . .} where each color class is a matching with cardinality bounded by u, we show that there exists a totally multicolored subset Y ⊆ X with |Y | ≥ max { c1 · ( n/u ) 1 2k−1 , c2 · ( n/u ) 1 2k−1 · ( ln ( u/ √ n )) 1 2k−1 } This bound is tight up to constant factors for u = ω(n ) for any > 0. Moreover, for fixed k, we give a polynom...
متن کاملPartial list colorings
Suppose G is an s-choosable graph with n vertices, and every vertex of G is assigned a list of t colors. We conjecture that at least t s · n of the vertices of G can be colored from these lists. We provide lower bounds and consider related questions. For instance we show that if G is χ-colorable (rather than being s-choosable), then more than ( 1 − ( χ−1 χ )t) · n of the vertices of G can be co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2015
ISSN: 1077-8926
DOI: 10.37236/4387